Towards an Operational Understanding of Presheaf Models
نویسنده
چکیده
ion and application , x : P ⊢ t : Q ⊢ x.t : P ⊸ Q P t −→ Q curry t −−−−→ P ⊸ Q ⊢ t : P ⊸ Q ⊢ u : P , ⊢ t · u : Q t −→ P ⊸ Q u −→ P (uncurry t) ◦ (1 u) −−−−−−−−−−−−−→ Q Recursion and sum , x : P ⊢ t : P ⊢ rec x.t : P P t −→ P fix t −−−→ P ⊢ ti : P all i ∈ I ⊢ Σi∈Iti : P ti −→ P all i ∈ I Σi∈Iti −−−−→ P In the rule for recursion, x, y must not be crossed in t, for any y in .
منابع مشابه
Presheaf models and process calculi
Process calculi like CCS have been motivated and studied operationally, thus from the outset lacking the abstract mathematical treatment provided by a domain theory. Consequently, concurrency has become a rather separate study; in particular, higher-order and functional features as known from sequential programming are most often treated in an ad hoc fashion, if at all. The study of presheaf mo...
متن کاملA Presheaf Semantics of Value-Passing Processes
This paper investigates presheaf models for process calculi with value passing. Denotational semantics in presheaf models are shown to correspond to operational semantics in that bisimulation obtained from open maps is proved to coincide with bisimulation as defined traditionally from the operational semantics. Both “early” and “late” semantics are considered, though the more interesting “late”...
متن کاملPresheaf Models for Concurrency
In this dissertation we investigate presheaf models for concurrent computation. Our aim is to provide a systematic treatment of bisimulation for a wide range of concurrent process calculi. Bisimilarity is defined abstractly in terms of open maps as in the work of Joyal, Nielsen and Winskel. Their work inspired this thesis by suggesting that presheaf categories could provide abstract models for ...
متن کاملNew-HOPLA: A Higher-order Process Language with Name Generation
This paper introduces new-HOPLA, a concise but powerful language for higher-order nondeterministic processes with name generation. Its origins as a metalan-guage for domain theory are sketched but for the most part the paper concentrateson its operational semantics. The language is typed, the type of a process describingthe shape of the computation paths it can perform. Its ...
متن کاملCategorical Models for Fairness and a Fully Abstract Presheaf Semantics of SCCS with Finite Delay?
We present a presheaf model for the observation of infinite as well as finite computations. We apply it to give a denotational semantics of SCCS with finite delay, in which the meanings of recursion are given by final coalgebras and meanings of finite delay by initial algebras of the process equations for delay. This can be viewed as a first step in representing fairness in presheaf semantics. ...
متن کامل